Expected time analysis for Delaunay point location

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expected time analysis for Delaunay point location

Abstract. We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first locate a point close to the query point. For points uniformly distributed on the unit square, we show that the expected point location complexities are Θ( √ n) for the Green-Sibson rectilinear search, Θ(n) for...

متن کامل

Fast delaunay point location with search structures

We study the expected time behaviour of the Jumpand-walk paradigm when the set of sites is controlled by a binary search tree or a well-balanced 2-d tree. Throughout the paper, we shall assume that we are given a Delaunay triangulation on N sites uniformly distributed in the unit 2-dimensional square, [0; 1]. We are requested to locate a query point q, which will be assumed to be bounded away f...

متن کامل

Optimal Expected-Case Planar Point Location

Point location is the problem of preprocessing a planar polygonal subdivision S of size n into a data structure in order to determine efficiently the cell of the subdivision that contains a given query point. We consider this problem from the perspective of expected query time. We are given the probabilities pz that the query point lies within each cell z ∈ S. The entropy H of the resulting dis...

متن کامل

Nearly Optimal Expected-Case Planar Point Location

We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision the probability that a query point lies within this polygon. The goal is to compute a search structure to determine which cell of the subdivision contains a given query point, so as to minimize the expected search time....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 2004

ISSN: 0925-7721

DOI: 10.1016/j.comgeo.2004.02.002